ifft — Inverse Fourier Tranform
ifft computes a discrete Fourier transform of the
input. Unlike fft, the output is scaled by the reciprocal of the
number of elements in the input, such that
a call to fft followed by a call to ifft()
will reproduce the original matrix. The resultant is always complex.
The argument must be a matrix. If it is a row or column matrix
then a Fourier transformation is performed on that vector. If
it is not such a vector, then Fourier transform is performed
on each column in turn.
The optional scalar argument can be used to zero-pad or to truncate
the argument to the length given as the scalar.
To perform two dimensional Inverse Fourier Transforms, repeated calls to
ifft are required, taking the second call in the other direction.
This is shown below.
Subsections